Ant Colony Optimisation for Machine Layout Problems

Flexible machine layout problems describe the dynamic arrangement of machines to optimise the trade-off between material handling and rearrangement costs under changing and uncertain production environments. A previous study used integer-programming techniques to solve heuristically reduced versions of the problem. As an alternative, this paper introduces an ant colony optimisation (ACO) algorithm to generate good solutions. Experimental results are presented, with ACO obtaining better solutions than the reduction heuristic.     

非均匀网格定位模型

在正方形网格钻井布局模型的基础上 ,讨论了非均匀网格定位模型 .一般情形可用穷举法求解最优化问题来解决定位问题 .本文给出了一种更为有效的定位方法     

一种红外热像文件及其图像的处理方法

把一种特殊的红外热图文件转换成了温度文件(纯文本格式),获取了温度场温度值数据的分布,进而用阈值设定伪彩色处理的方法实现了灵活的图像分割,用图像相减的方法获得了红外辐射温度场分布的变化,同时抑制了静态噪声的影响。用这些方法处理有利于对红外热图进行量化分析,并可以推广到各种红外热像仪的输出图像或数据流通和处理。     

Improving Penalized Least Squares through Adaptive Selection of Penalty and Shrinkage

Estimation of the mean function in nonparametric regression is usefully separated into estimating the means at the observed factor levels—a one-way layout problem—and interpolation between the estimated means at adjacent factor levels. Candidate penalized least squares (PLS) estimators for the mean vector of a one-way layout are expressed as shrinkage estimators relative to an orthogonal regression basis determined by the penalty matrix. The shrinkage representation of PLS suggests a larger class of candidate monotone shrinkage (MS) estimators. Adaptive PLS and MS estimators choose the shrinkage vector and penalty matrix to minimize estimated risk. The actual risks of shrinkage-adaptive estimators depend strongly upon the economy of the penalty basis in representing the unknown mean vector. Local annihilators of polynomials, among them difference operators, generate penalty bases that are economical in a range of examples. Diagnostic techniques for adaptive PLS or MS estimators include basis-economy plots and estimates of loss or risk.     

ASP fits to multi-way layouts

The balanced complete multi-way layout with ordinal or nominal factors is a fundamental data-type that arises in medical imaging, agricultural field trials, DNA microassays, and other settings where analysis of variance (ANOVA) is an established tool. ASP algorithms weigh competing biased fits in order to reduce risk through variance-bias tradeoff. The acronym ASP stands for Adaptive Shrinkage of Penalty bases. Motivating ASP is a penalized least squares criterion that associates a separate quadratic penalty term with each main effect and each interaction in the general ANOVA decomposition of means. The penalty terms express plausible conjecture about the mean function, respecting the difference between ordinal and nominal factors. Multiparametric asymptotics under a probability model and experiments on data elucidate how ASP dominates least squares, sometimes very substantially. ASP estimators for nominal factors recover Stein's superior shrinkage estimators for one- and two-way layouts. ASP estimators for ordinal factors bring out the merits of smoothed fits to multi-way layouts, a topic broached algorithmically in work by Tukey. This research was supported in part by National Science Foundation Grants DMS 0300806 and 0404547.     

A polyhedral study of triplet formulation for single row facility layout problem

The single row facility layout problem (SRFLP) is the problem of arranging n departments with given lengths on a straight line so as to minimize the total weighted distance between all department pairs. We present a polyhedral study of the triplet formulation of the SRFLP introduced by Amaral [A.R.S. Amaral, A new lower bound for the single row facility layout problem, Discrete Applied Mathematics 157 (1) (2009) 183-190]. For any number of departments n, we prove that the dimension of the triplet polytope is n(n−1)(n−2)/3 (this is also true for the projections of this polytope presented by Amaral). We then prove that several valid inequalities presented by Amaral for this polytope are facet-defining. These results provide theoretical support for the fact that the linear program solved over these valid inequalities gives the optimal solution for all instances studied by Amaral.     

基于数值仿真船体结构毁伤测点布设方法研究

为有效测量水下爆炸作用下船体结构的毁伤程度,优化测点布设,建立了典型舰船有限元模型,运用大型有限元分析软件ABAQUS提供的声固耦合方法,对船体结构在爆炸载荷作用下的冲击响应进行仿真。依据数值仿真结果,分析船体结构薄弱环节,并将这些薄弱环节作为重点测量部位,结合工程实践和海上试验经验,在准确测量结构毁伤的基础上,合理布设传感器测点,研究设计了水下爆炸作用下船体结构毁伤测点布设方法。经海上爆炸试验验证,数值仿真结果与试验测试结果吻合良好,该毁伤测点布设方法设计合理。     

Optimizing the initial setting of complex adaptive systems–optimizing the layout of initial AFVs stations for maximizing the diffusion of AFVs

There are occasions when people want to optimize the initial setting of a CAS (complex adaptive system) so that it evolves in a desired direction. A CAS evolves by heterogeneous actors interacting with each other. It is difficult to describe the evolution process with an objective function. Researchers usually attempt to optimize an intervening objective function, which is supposed to help a CAS evolve in a desired direction. This article puts forward an approach to optimize the initial setting of a CAS directly (instead of through an intervening objective function) by nesting agent‐based simulations in a genetic algorithm. In the approach, an initial setting of a CAS is treated as a genome, and its fitness is defined by the closeness between the simulation result and the desired evolution. We test the applicability of the proposed approach on the problem of optimizing the layout of initial AFV (alternative fuel vehicle) refueling stations to maximize the diffusion of AFVs. Computation experiments show that the initial setting generated with the approach could better induce the desired evolving result than optimizing an intervening objective function. The idea of the approach can also be applied to other decision making associated with a complex adaptive process. © 2015 Wiley Periodicals, Inc. Complexity 21: 275–290, 2016     

多车型车辆调度问题的优化模型

基于第十一届"华为杯"全国研究生数学建模竞赛E题第五问,针对一类多车型多目的地的整车物流运输调度问题,先直接计算完成总任务所需的车辆数来阐明该题的最优解的下界限为113辆,再对原始数据进行预处理,基于对乘用车的分类与排样算法,筛选出每种轿运车的M种装载方案代表,再对目的地位置及结合各目的地的任务需求,确定出3条不绕行路线,根据启发式调整优化算法,并以轿运车使用量最少及总行驶里程最短为优化目标,建立了多目标整数规划模型进行求解,最优可行解为114辆,其中1-1型91辆,1-2型18辆,2-2型5辆.     

The Model for Two-dimensional Layout Optimization Problem with Performance Constraints and Its Optimality Function

This paper studies the two-dimensional layout optimization problem.An optimization model withperformance constraints is presented.The layout problem is partitioned into finite subproblems in terms ofgraph theory,in such a way of that each subproblem overcomes its on-off nature optimal variable.A minimaxproblem is constructed that is locally equivalent to each subproblem.By using this minimax problem,we presentthe optimality function for every subproblem and prove that the first order necessary optimality condition issatisfied at a point if and only if this point is a zero of optimality function.